l = list(map(int,input().split()))
l2 = list(map(int,input().split()))
state = []
cur = l[0]
for i in l2 :
if i <= cur :
for j in range(i,cur+1):
state.insert(0,i)
cur = i-1
print(*state)// https://codeforces.com/problemset/problem/415/A
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m, b[101], a;
memset(b, 0, sizeof(b));
cin >> n >> m;
while (m--)
{
cin >> a;
for (int i = a - 1; i < n; i++)
{
if (b[i] == 0)
b[i] = a;
else
break;
}
}
for (int i = 0; i < n; i++) {
cout << b[i] << " ";
}
return 0;
}1157E - Minimum Array | 1661D - Progressions Covering |
262A - Roma and Lucky Numbers | 1634B - Fortune Telling |
1358A - Park Lighting | 253C - Text Editor |
365B - The Fibonacci Segment | 75A - Life Without Zeros |
1519A - Red and Blue Beans | 466A - Cheap Travel |
659E - New Reform | 1385B - Restore the Permutation by Merger |
706A - Beru-taxi | 686A - Free Ice Cream |
1358D - The Best Vacation | 1620B - Triangles on a Rectangle |
999C - Alphabetic Removals | 1634C - OKEA |
1368C - Even Picture | 1505F - Math |
1473A - Replacing Elements | 959A - Mahmoud and Ehab and the even-odd game |
78B - Easter Eggs | 1455B - Jumps |
1225C - p-binary | 1525D - Armchairs |
1257A - Two Rival Students | 1415A - Prison Break |
1271A - Suits | 259B - Little Elephant and Magic Square |